Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
c(x1) → a(a(a(a(x1))))
d(x1) → b(b(b(b(x1))))
b(d(x1)) → c(c(x1))
a(c(c(c(x1)))) → d(d(x1))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
c(c(c(a(x1)))) → d(d(x1))
d(b(x1)) → c(c(x1))
c(x1) → a(a(a(a(x1))))
d(x1) → b(b(b(b(x1))))
b(d(x1)) → c(c(x1))
a(c(c(c(x1)))) → d(d(x1))
Q is empty.
We use [27] with the following order to prove termination.
Knuth-Bendix order [24] with precedence:trivial
and weight map:
c_1=4862
d_1=7786
b_1=1946
a_1=1214
dummyConstant=1